0.10/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.11 % Command : run_vampire %s %d 0.10/0.31 % Computer : n013.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 06:41:19 EDT 2020 0.10/0.31 % CPUTime : 0.10/0.33 % (25996)lrs+1011_8_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=100000:afq=1.1:er=filter:gsp=input_only:gs=on:gsem=on:lma=on:nm=6:nwc=1:stl=30:sd=2:ss=axioms:st=1.5:sos=on_3 on theBenchmark 0.10/0.34 % (25995)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on_2 on theBenchmark 0.10/0.34 % (26008)lrs+1002_1_av=off:er=filter:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:fsr=off:gs=on:gsem=off:irw=on:lma=on:nm=4:nwc=1:stl=30:sd=3:ss=axioms:st=1.5:sos=on_1 on theBenchmark 0.10/0.35 % (25996)Refutation not found, incomplete strategy 0.10/0.35 % (25996)------------------------------ 0.10/0.35 % (25996)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100) 0.10/0.35 % (25996)Termination reason: Refutation not found, incomplete strategy 0.10/0.35 0.10/0.35 % (25996)Memory used [KB]: 9722 0.10/0.35 % (25996)Time elapsed: 0.006 s 0.10/0.35 % (25996)------------------------------ 0.10/0.35 % (25996)------------------------------ 0.10/0.35 % (25997)dis+10_128_acc=on:add=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_2 on theBenchmark 0.10/0.35 % (25994)ott+1002_2_av=off:bd=preordered:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:irw=on:lma=on:nm=64:nwc=10:sp=reverse_arity:updr=off_2 on theBenchmark 0.10/0.35 % (26000)lrs+1011_5:1_acc=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off_3 on theBenchmark 0.10/0.36 % (26017)lrs+1002_1_add=large:csup=on:inj=on:fe=off:chr=on:foolp=on:cnfonf=eager:afr=on:afp=1000:afq=1.1:amm=sco:anc=none:er=known:fsr=off:gs=on:gsem=off:lma=on:nm=2:newcnf=on:nwc=2:stl=30:sd=1:ss=axioms:st=5.0:sp=reverse_arity:updr=off_50 on theBenchmark 0.10/0.36 % (26009)ott+2_2_afp=10000:afq=1.4:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:amm=off:anc=none:gsp=input_only:gs=on:gsem=off:irw=on:lcm=predicate:nm=32:nwc=1.5:sos=on:sp=reverse_arity_7 on theBenchmark 0.10/0.36 % (26011)lrs+1011_5:1_acc=on:csup=on:inj=on:e2e=on:prag=on:foolp=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off_30 on theBenchmark 0.10/0.36 % (26023)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:e2e=on:prag=on:foolp=on:cnfonf=eager:afq=1.0:fde=all:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on_50 on theBenchmark 0.10/0.36 % (25999)ott+1002_8:1_add=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afr=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:bs=unit_only:fsr=off:gs=on:gsem=off:nm=32:nwc=10:sp=occurrence:urr=on:updr=off_14 on theBenchmark 0.10/0.36 % (26012)ott+11_20_afr=on:afp=100000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=1.0:amm=sco:anc=all:bsr=on:irw=on:lma=on:nm=4:nwc=1.2:sac=on:sp=occurrence_6 on theBenchmark 0.10/0.36 % (26018)lrs+1011_5_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=1000:afq=1.2:anc=none:fsr=off:irw=on:lma=on:nm=64:newcnf=on:nwc=1:stl=30:sd=3:ss=axioms:st=2.0:sos=on:sac=on:sp=reverse_arity:urr=on:updr=off_130 on theBenchmark 0.10/0.37 % (26005)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=1.0:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on_2 on theBenchmark 0.10/0.37 % (25998)lrs+1010_8_add=off:afp=100000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on_13 on theBenchmark 0.10/0.37 % (26004)dis+10_128_acc=on:add=off:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_40 on theBenchmark 0.10/0.37 % (26016)dis+10_4_av=off:bsr=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:cond=fast:er=filter:fde=none:gsp=input_only:lcm=reverse:lma=on:nwc=4:sp=occurrence:urr=on_8 on theBenchmark 0.10/0.37 % (26006)dis+1002_6_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=40000:afq=2.0:bsr=on:cond=on:irw=on:lma=on:nm=2:nwc=2.5:nicw=on:sp=reverse_arity:updr=off_2 on theBenchmark 0.10/0.37 % (26010)lrs+1010_3:2_afr=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=100000:afq=1.1:anc=none:gsp=input_only:irw=on:lwlo=on:nm=2:newcnf=on:nwc=1.7:sac=on:sp=occurrence_300 on theBenchmark 0.10/0.37 % (26001)lrs+4_3_av=off:br=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on_32 on theBenchmark 0.10/0.37 % (26000)Refutation not found, incomplete strategy 0.10/0.37 % (26000)------------------------------ 0.10/0.37 % (26000)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100) 0.10/0.37 % (26000)Termination reason: Refutation not found, incomplete strategy 0.10/0.37 0.10/0.37 % (26000)Memory used [KB]: 9722 0.10/0.37 % (26000)Time elapsed: 0.038 s 0.10/0.37 % (26000)------------------------------ 0.10/0.37 % (26000)------------------------------ 0.10/0.38 % (26006)Refutation found. Thanks to Tanya! 0.10/0.38 % SZS status Theorem for theBenchmark 0.10/0.38 % SZS output start Proof for theBenchmark 0.10/0.38 tff(func_def_3, type, ->: ('$tType' * '$tType') > '$tType'). 0.10/0.38 tff(func_def_4, type, cP: '$i' -> '$o'). 0.10/0.38 tff(func_def_5, type, s: '$i' -> '$o'). 0.10/0.38 tff(func_def_6, type, cR: '$i' -> '$i' -> '$o'). 0.10/0.38 tff(func_def_7, type, vAPP: !>[X0: $ttype, X1: $ttype]:(X0 -> X1 * X0) > X1). 0.10/0.38 tff(func_def_8, type, vEPSILON: !>[X0: $ttype]:(X0 -> '$o') -> X0). 0.10/0.38 tff(func_def_11, type, sP0: '$i' -> '$o'). 0.10/0.38 tff(func_def_12, type, sK1: '$i' -> '$i'). 0.10/0.38 tff(func_def_14, type, sK3: ('$i' -> '$o') -> '$i'). 0.10/0.38 tff(func_def_16, type, kCOMB: !>[X1: $ttype, X2: $ttype]:X1 -> X2 -> X1). 0.10/0.38 tff(func_def_17, type, bCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X1 -> X2) -> (X0 -> X1) -> X0 -> X2). 0.10/0.38 tff(func_def_18, type, vAND: '$o' -> '$o' -> '$o'). 0.10/0.38 tff(func_def_19, type, vOR: '$o' -> '$o' -> '$o'). 0.10/0.38 tff(func_def_20, type, vIMP: '$o' -> '$o' -> '$o'). 0.10/0.38 tff(func_def_21, type, vNOT: '$o' -> '$o'). 0.10/0.38 tff(func_def_22, type, vEQ: !>[X0: $ttype]:X0 -> X0 -> '$o'). 0.10/0.38 tff(func_def_23, type, sCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X0 -> X1 -> X2) -> (X0 -> X1) -> X0 -> X2). 0.10/0.38 tff(func_def_24, type, cCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X0 -> X1 -> X2) -> X1 -> X0 -> X2). 0.10/0.38 tff(func_def_25, type, iCOMB: !>[X2: $ttype]:X2 -> X2). 0.10/0.38 tff(f1,conjecture,( 0.10/0.38 (! [X2 : '$i' -> '$o',X3] : (X2 @ X3 => ? [X4] : (! [X5] : (cR @ X4 @ X5 => ~X2 @ X5) & X2 @ X4)) & ! [X0] : (! [X1] : ((cR @ X0 @ X1 & s @ X1) => cP @ X1) => cP @ X0)) => ! [X6] : (s @ X6 => cP @ X6)), 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM117B)). 0.10/0.38 tff(f2,negated_conjecture,( 0.10/0.38 ~((! [X2 : '$i' -> '$o',X3] : (X2 @ X3 => ? [X4] : (! [X5] : (cR @ X4 @ X5 => ~X2 @ X5) & X2 @ X4)) & ! [X0] : (! [X1] : ((cR @ X0 @ X1 & s @ X1) => cP @ X1) => cP @ X0)) => ! [X6] : (s @ X6 => cP @ X6))), 0.10/0.38 inference(negated_conjecture,[],[f1])). 0.10/0.38 tff(f3,plain,( 0.10/0.38 ~((! [X0 : '$i' -> '$o',X1] : (X0 @ X1 => ? [X2] : (! [X3] : (cR @ X2 @ X3 => ~X0 @ X3) & X0 @ X2)) & ! [X4] : (! [X5] : ((cR @ X4 @ X5 & s @ X5) => cP @ X5) => cP @ X4)) => ! [X6] : (s @ X6 => cP @ X6))), 0.10/0.38 inference(rectify,[],[f2])). 0.10/0.38 tff(f4,plain,( 0.10/0.38 ~((! [X0 : '$i' -> '$o',X1] : ((X0 @ X1 = $true) => ? [X2] : (! [X3] : ((cR @ X2 @ X3 = $true) => ~(X0 @ X3 = $true)) & (X0 @ X2 = $true))) & ! [X4] : (! [X5] : (((cR @ X4 @ X5 = $true) & (s @ X5 = $true)) => (cP @ X5 = $true)) => (cP @ X4 = $true))) => ! [X6] : ((s @ X6 = $true) => (cP @ X6 = $true)))), 0.10/0.38 inference(fool_elimination,[],[f3])). 0.10/0.38 tff(f5,plain,( 0.10/0.38 ~((! [X0 : '$i' -> '$o',X1] : ((X0 @ X1 = $true) => ? [X2] : (! [X3] : ((cR @ X2 @ X3 = $true) => (X0 @ X3 != $true)) & (X0 @ X2 = $true))) & ! [X4] : (! [X5] : (((cR @ X4 @ X5 = $true) & (s @ X5 = $true)) => (cP @ X5 = $true)) => (cP @ X4 = $true))) => ! [X6] : ((s @ X6 = $true) => (cP @ X6 = $true)))), 0.10/0.38 inference(flattening,[],[f4])). 0.10/0.38 tff(f6,plain,( 0.10/0.38 ? [X6] : ((cP @ X6 != $true) & (s @ X6 = $true)) & (! [X0 : '$i' -> '$o',X1] : (? [X2] : (! [X3] : ((X0 @ X3 != $true) | (cR @ X2 @ X3 != $true)) & (X0 @ X2 = $true)) | (X0 @ X1 != $true)) & ! [X4] : ((cP @ X4 = $true) | ? [X5] : ((cP @ X5 != $true) & ((cR @ X4 @ X5 = $true) & (s @ X5 = $true)))))), 0.10/0.38 inference(ennf_transformation,[],[f5])). 0.10/0.38 tff(f7,plain,( 0.10/0.38 ? [X6] : ((cP @ X6 != $true) & (s @ X6 = $true)) & ! [X0 : '$i' -> '$o',X1] : (? [X2] : (! [X3] : ((X0 @ X3 != $true) | (cR @ X2 @ X3 != $true)) & (X0 @ X2 = $true)) | (X0 @ X1 != $true)) & ! [X4] : ((cP @ X4 = $true) | ? [X5] : ((cP @ X5 != $true) & (cR @ X4 @ X5 = $true) & (s @ X5 = $true)))), 0.10/0.38 inference(flattening,[],[f6])). 0.10/0.38 tff(f8,plain,( 0.10/0.38 ! [X4] : (? [X5] : ((cP @ X5 != $true) & (cR @ X4 @ X5 = $true) & (s @ X5 = $true)) | ~(sP0 @ X4 = $true))), 0.10/0.38 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])). 0.10/0.38 tff(f9,plain,( 0.10/0.38 ? [X6] : ((cP @ X6 != $true) & (s @ X6 = $true)) & ! [X0 : '$i' -> '$o',X1] : (? [X2] : (! [X3] : ((X0 @ X3 != $true) | (cR @ X2 @ X3 != $true)) & (X0 @ X2 = $true)) | (X0 @ X1 != $true)) & ! [X4] : ((cP @ X4 = $true) | (sP0 @ X4 = $true))), 0.10/0.38 inference(definition_folding,[],[f7,f8])). 0.10/0.38 tff(f10,plain,( 0.10/0.38 ! [X4] : (? [X5] : ((cP @ X5 != $true) & (cR @ X4 @ X5 = $true) & (s @ X5 = $true)) | (sP0 @ X4 != $true))), 0.10/0.38 inference(nnf_transformation,[],[f8])). 0.10/0.38 tff(f11,plain,( 0.10/0.38 ! [X0] : (? [X1] : ((cP @ X1 != $true) & (cR @ X0 @ X1 = $true) & (s @ X1 = $true)) | (sP0 @ X0 != $true))), 0.10/0.38 inference(rectify,[],[f10])). 0.10/0.38 tff(f12,plain,( 0.10/0.38 ! [X0] : (? [X1] : ((cP @ X1 != $true) & (cR @ X0 @ X1 = $true) & (s @ X1 = $true)) => ((cP @ (sK1 @ X0) != $true) & (cR @ X0 @ (sK1 @ X0) = $true) & (s @ (sK1 @ X0) = $true)))), 0.10/0.38 introduced(choice_axiom,[])). 0.10/0.38 tff(f13,plain,( 0.10/0.38 ! [X0] : (((cP @ (sK1 @ X0) != $true) & (cR @ X0 @ (sK1 @ X0) = $true) & (s @ (sK1 @ X0) = $true)) | (sP0 @ X0 != $true))), 0.10/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f12])). 0.10/0.38 tff(f14,plain,( 0.10/0.38 ? [X0] : ((cP @ X0 != $true) & (s @ X0 = $true)) & ! [X1 : '$i' -> '$o',X2] : (? [X3] : (! [X4] : ((X1 @ X4 != $true) | (cR @ X3 @ X4 != $true)) & (X1 @ X3 = $true)) | (X1 @ X2 != $true)) & ! [X5] : ((cP @ X5 = $true) | (sP0 @ X5 = $true))), 0.10/0.38 inference(rectify,[],[f9])). 0.10/0.38 tff(f15,plain,( 0.10/0.38 ? [X0] : ((cP @ X0 != $true) & (s @ X0 = $true)) => ((cP @ sK2 != $true) & (s @ sK2 = $true))), 0.10/0.38 introduced(choice_axiom,[])). 0.10/0.38 tff(f16,plain,( 0.10/0.38 ! [X1 : '$i' -> '$o'] : (? [X3] : (! [X4] : ((X1 @ X4 != $true) | (cR @ X3 @ X4 != $true)) & (X1 @ X3 = $true)) => (! [X4] : ((X1 @ X4 != $true) | (cR @ (sK3 @ X1) @ X4 != $true)) & (X1 @ (sK3 @ X1) = $true)))), 0.10/0.38 introduced(choice_axiom,[])). 0.10/0.38 tff(f17,plain,( 0.10/0.38 ((cP @ sK2 != $true) & (s @ sK2 = $true)) & ! [X1 : '$i' -> '$o',X2] : ((! [X4] : ((X1 @ X4 != $true) | (cR @ (sK3 @ X1) @ X4 != $true)) & (X1 @ (sK3 @ X1) = $true)) | (X1 @ X2 != $true)) & ! [X5] : ((cP @ X5 = $true) | (sP0 @ X5 = $true))), 0.10/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f14,f16,f15])). 0.10/0.38 tff(f19,plain,( 0.10/0.38 ( ! [X0] : ((cR @ X0 @ (sK1 @ X0) = $true) | (sP0 @ X0 != $true)) )), 0.10/0.38 inference(cnf_transformation,[],[f13])). 0.10/0.38 tff(f20,plain,( 0.10/0.38 ( ! [X0] : ((cP @ (sK1 @ X0) != $true) | (sP0 @ X0 != $true)) )), 0.10/0.38 inference(cnf_transformation,[],[f13])). 0.10/0.38 tff(f21,plain,( 0.10/0.38 ( ! [X5] : ((sP0 @ X5 = $true) | (cP @ X5 = $true)) )), 0.10/0.38 inference(cnf_transformation,[],[f17])). 0.10/0.38 tff(f23,plain,( 0.10/0.38 ( ! [X4,X2,X1:'$i' -> '$o'] : ((X1 @ X4 != $true) | (cR @ (sK3 @ X1) @ X4 != $true) | (X1 @ X2 != $true)) )), 0.10/0.38 inference(cnf_transformation,[],[f17])). 0.10/0.38 tff(f25,plain,( 0.10/0.38 (cP @ sK2 != $true)), 0.10/0.38 inference(cnf_transformation,[],[f17])). 0.10/0.38 tff(f26,plain,( 0.10/0.38 ( ! [X0:'$i' -> '$o',X1] : ((cR @ (sK3 @ X0) @ X1 != $true) | (X0 @ X1 != $true)) )), 0.10/0.38 inference(condensation,[],[f23])). 0.10/0.38 tff(f28,plain,( 0.10/0.38 ($true != $true) | (cP @ sK2 = $false)), 0.10/0.38 inference(fool_paramodulation,[],[f25])). 0.10/0.38 tff(f29,plain,( 0.10/0.38 (cP @ sK2 = $false)), 0.10/0.38 inference(trivial_inequality_removal,[],[f28])). 0.10/0.38 tff(f46,plain,( 0.10/0.38 ( ! [X1:'$i' -> '$o'] : (($true != $true) | (X1 @ (sK1 @ (sK3 @ X1)) != $true) | (sP0 @ (sK3 @ X1) != $true)) )), 0.10/0.38 inference(superposition,[],[f26,f19])). 0.10/0.38 tff(f47,plain,( 0.10/0.38 ( ! [X1:'$i' -> '$o'] : ((X1 @ (sK1 @ (sK3 @ X1)) != $true) | (sP0 @ (sK3 @ X1) != $true)) )), 0.10/0.38 inference(trivial_inequality_removal,[],[f46])). 0.10/0.38 tff(f61,plain,( 0.10/0.38 ($true != $true) | (sP0 @ (sK3 @ sP0) != $true) | (cP @ (sK1 @ (sK3 @ sP0)) = $true)), 0.10/0.38 inference(superposition,[],[f47,f21])). 0.10/0.38 tff(f63,plain,( 0.10/0.38 (sP0 @ (sK3 @ sP0) != $true) | (cP @ (sK1 @ (sK3 @ sP0)) = $true)), 0.10/0.38 inference(trivial_inequality_removal,[],[f61])). 0.10/0.38 tff(f72,plain,( 0.10/0.38 (sP0 @ (sK3 @ sP0) != $true)), 0.10/0.38 inference(subsumption_resolution,[],[f63,f20])). 0.10/0.38 tff(f89,plain,( 0.10/0.38 ( ! [X1] : ((sP0 @ X1 = $false) | (sP0 @ (sK3 @ sP0) = $true)) )), 0.10/0.38 introduced(choice_axiom,[])). 0.10/0.38 tff(f93,plain,( 0.10/0.38 ( ! [X1] : ((sP0 @ X1 = $false)) )), 0.10/0.38 inference(subsumption_resolution,[],[f89,f72])). 0.10/0.38 tff(f98,plain,( 0.10/0.38 ( ! [X5] : (($false = $true) | (cP @ X5 = $true)) )), 0.10/0.38 inference(backward_demodulation,[],[f93,f21])). 0.10/0.38 tff(f102,plain,( 0.10/0.38 ( ! [X5] : ((cP @ X5 = $true)) )), 0.10/0.38 inference(trivial_inequality_removal,[],[f98])). 0.10/0.38 tff(f105,plain,( 0.10/0.38 ($false = $true)), 0.10/0.38 inference(superposition,[],[f29,f102])). 0.10/0.38 tff(f106,plain,( 0.10/0.38 $false), 0.10/0.38 inference(trivial_inequality_removal,[],[f105])). 0.10/0.38 % SZS output end Proof for theBenchmark 0.10/0.38 % (26006)------------------------------ 0.10/0.38 % (26006)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100) 0.10/0.38 % (26006)Termination reason: Refutation 0.10/0.38 0.10/0.38 % (26006)Memory used [KB]: 5245 0.10/0.38 % (26006)Time elapsed: 0.043 s 0.10/0.38 % (26006)------------------------------ 0.10/0.38 % (26006)------------------------------ 0.10/0.38 % (25993)Success in time 0.052 s 0.10/0.38 EOF